Prime factorization by interval-valued computing
نویسندگان
چکیده
منابع مشابه
Computing discrete logarithm by interval-valued paradigm
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiability of Quantified Boolean formulae and other hard problems, like integer factorization, can be solved in an effective way by its massive parallelism. The discrete logarithm problem plays an important role in practice,...
متن کاملInterval Valued Fuzzy Prime Bi-ideals and Interval Valued Fuzzy Strongly Prime Bi-ideals in Near-rings
In this paper, prime, strongly prime, irreducible and strongly irreducible ideals of an interval valued fuzzy bi-ideals are defined and some results are explored.
متن کاملInterval-valued Fuzzy Sets in Soft Computing
In this work, we explain the reasons for which, for some specific problems, interval-valued fuzzy sets must be considered a basic component of Soft Computing.
متن کاملOn Interval-valued Fuzzy Prime Bi-ideals of Semigroups
In this paper, we introduce the notions of interval-valued fuzzy prime (resp. strongly prime and semiprime) bi-ideals of a semigroup. By using these ideas we characterize those semigroups for which each interval-valued fuzzy bi-ideal is semiprime and strongly prime.
متن کاملInterval-valued fuzzy prime and semiprime ideals of a hypersemiring
In this paper we introduce the notion of interval-valued (i.v.) fuzzy prime and semiprime ideals of a hypersemiring and study different properties of these two ideals. Finally, we examine the strongly irreducibility and irreducibility of an i.v. fuzzy ideal of a hypersemiring and characterize the equivalence of primeness, strongly irreducibility and irreducibility of an i.v. fuzzy ideal of a fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicationes Mathematicae Debrecen
سال: 2011
ISSN: 0033-3883
DOI: 10.5486/pmd.2011.5134